dp implementation

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
const int N=200001;
#define ll long long




int main() {
     ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
          int cnt[200005] = {0};
     ll sum = 0;
     for(int i=1; i<=200000; i++) {
         string s = to_string(i);
 
         for(int j=0; j<s.size(); j++) {
             sum += s[j] - 48;
         }
         cnt[i] = sum;
     }
    int t;
    cin >> t;
    while(t--)
    {
        int n;
        cin>>n;
        cout<<cnt[n]<<endl;
    }
   
     }


Comments

Submit
0 Comments
More Questions

1487A - Arena
1520D - Same Differences
376A - Lever
1305A - Kuroni and the Gifts
1609A - Divide and Multiply
149B - Martian Clock
205A - Little Elephant and Rozdil
1609B - William the Vigilant
978B - File Name
1426B - Symmetric Matrix
732B - Cormen --- The Best Friend Of a Man
1369A - FashionabLee
1474B - Different Divisors
1632B - Roof Construction
388A - Fox and Box Accumulation
451A - Game With Sticks
768A - Oath of the Night's Watch
156C - Cipher
545D - Queue
459B - Pashmak and Flowers
1538A - Stone Game
1454C - Sequence Transformation
165B - Burning Midnight Oil
17A - Noldbach problem
1350A - Orac and Factors
1373A - Donut Shops
26A - Almost Prime
1656E - Equal Tree Sums
1656B - Subtract Operation
1656A - Good Pairs